Search results for "finite [mass]"
showing 10 items of 356 documents
Modeling of anisotropic grain growth in minerals
2001
The role of surface energy anisotropy during grain growth is investigated using both physical experiments on octachloropropane and numerical experiments using the Elle microstructural modelling system. In particular the effects of anisotropy on growth rates, grain shapes and lattice preferred orientations are analysed. Anisotropic growth in thin polycrystalline sheets of octachloropropane is found to systematically remove certain c-axis orientations from the sample, without obviously modifying the grain shapes. By comparison with equivalent numerical experiments, we can explain these observations with a simple boundary layer model that treats each side of each grain boundary as an independe…
Languages associated with saturated formations of groups
2013
International audience; In a previous paper, the authors have shown that Eilenberg's variety theorem can be extended to more general structures, called formations. In this paper, we give a general method to describe the languages corresponding to saturated formations of groups, which are widely studied in group theory. We recover in this way a number of known results about the languages corresponding to the classes of nilpotent groups, soluble groups and supersoluble groups. Our method also applies to new examples, like the class of groups having a Sylow tower.; Dans un article précédent, les auteurs avaient montré comment étendre le théorème des variétés d'Eilenberg à des structures plus g…
Simple method for limiting delay of optimized interleavers for turbo-codes
2000
An iterative interleaver growth algorithm is extended to allow the delay and required memory of designed interleavers to be halved with negligible performance loss. The original algorithm is efficient for two-component parallel concatenated turbo-codes with given constituent encoders that are optimum with regard to a cost function satisfying some mild conditions. However, it is only actually optimum if the selected set of patterns is representative of low-weight turbo-codewords. The new interleaver uses all terminating error patterns having an input weight not greater than a fixed IWX and single-coder output weight not greater than WX is proposed.
Distinct trajectories of physical activity and related factors during the life course in the general population: a systematic review
2019
Background In recent years, researchers have begun applying a trajectory approach to identify homogeneous subgroups of physical activity (PA) in heterogeneous populations. This study systematically reviewed the articles identifying longitudinal PA trajectory classes and the related factors (e.g., determinants, predictors, and outcomes) in the general population during different life phases. Methods The included studies used finite mixture models for identifying trajectories of PA, exercise, or sport participation. Three electronic databases, PubMed (Medline), Web of Science, and CINAHL, were searched from the year 2000 to 13 February 2018. The study was conducted according to the PRISMA rec…
Reporting heterogeneity in health: an extended latent class approach
2012
This article explores how individual socio-economic characteristics affect unobserved heterogeneity in self-reporting behaviour and health production using a multivariate finite mixture model. Results show a positive relationship between objective and subjective observable health indicators and true health and support the existence of self-reporting bias related to socio-economic characteristics and individual life styles.
Hadronic light-by-light scattering contribution to the muon $g-2$ from lattice QCD: semi-analytical calculation of the QED kernel
2023
Hadronic light-by-light scattering is one of the virtual processes that causes the gyromagnetic factor $g$ of the muon to deviate from the value of two predicted by Dirac's theory. This process makes one of the largest contributions to the uncertainty of the Standard Model prediction for the muon $(g-2)$. Lattice QCD allows for a first-principles approach to computing this non-perturbative effect. In order to avoid power-law finite-size artifacts generated by virtual photons in lattice simulations, we follow a coordinate-space approach involving a weighted integral over the vertices of the QCD four-point function of the electromagnetic current carried by the quarks. Here we present in detai…
On the maximal superalgebras of supersymmetric backgrounds
2009
17 pages.-- ISI article identifier:000262585300016.-- ArXiv pre-print avaible at:http://arxiv.org/abs/0809.5034
Thouless-Valatin moment of inertia and removal of the spurious mode in the linear response theory
2020
Symmetry breaking at the mean-field level leads to an appearance of a symmetry restoring Nambu-Goldstone (NG) mode in the linear response theory. These modes represent a special kind of collective motion of the system. However, they can interfere with the calculated intrinsic physical excitations and, hence, they are often called as spurious modes. I discuss translational and rotational NG mode and the inertia parameter associated with these modes, by using the finite amplitude method formalism. I will also discuss how to remove spurious mode from the calculated transition strength function.
Generalized Camassa-Holm Equations: Symmetry, Conservation Laws and Regular Pulse and Front Solutions
2021
In this paper, we consider a member of an integrable family of generalized Camassa–Holm (GCH) equations. We make an analysis of the point Lie symmetries of these equations by using the Lie method of infinitesimals. We derive nonclassical symmetries and we find new symmetries via the nonclassical method, which cannot be obtained by Lie symmetry method. We employ the multiplier method to construct conservation laws for this family of GCH equations. Using the conservation laws of the underlying equation, double reduction is also constructed. Finally, we investigate traveling waves of the GCH equations. We derive convergent series solutions both for the homoclinic and heteroclinic orbits of the…
On Extremal Cases of the Hopcroft's Algorithm
2010
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees of freedom, so there can exist different executions that can lead to different sequences of refinements of the set of the states up to the final partition. We find an infinite family of binary automata for which such a process is unique, whatever strategy is chosen. Some recent papers (cf. Berstel and Carton (2004) [3], Castiglione et al. (2008) [6] and Berstel et al. (2009) [1]) have been devoted to find families of automata for which Hopcroft’s algorithm has its worst execution time. They are unary automata associated…